Perrin numbers that are concatenations of two repdigits
نویسندگان
چکیده
Abstract Let $$ (P_n)_{n\ge 0}$$ ( P n ) ? 0 be the sequence of Perrin numbers defined by ternary relation P_0=3 = 3 , P_1=0 1 P_2=2 2 and P_{n+3}=P_{n+1}+P_n + for all n\ge 0 . In this paper, we use Baker’s theory nonzero linear forms in logarithms algebraic reduction procedure involving continued fractions, to explicitly determine that are concatenations two repeated digit numbers.
منابع مشابه
Repdigits as sums of three Fibonacci numbers
In this paper, we find all base 10 repdigits which are sums of three Fibonacci numbers. AMS subject classifications: Primary 11D61; Secondary 11A67, 11B39
متن کاملThere are Infinitely Many Perrin Pseudoprimes
This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based on recurrence sequences. The result uses ingredients of the proof of the infinitude of Carmichael numbers, along with zero-density estimates for Hecke L-functions.
متن کاملOn perfect numbers which are ratios of two Fibonacci numbers ∗
Here, we prove that there is no perfect number of the form Fmn/Fm, where Fk is the kth Fibonacci number.
متن کاملOdd Repdigits to Small Bases Are Not Perfect
We demonstrate, by considering each base in the range 2 through 9, that no odd repdigit with a base in that range is a perfect number.
متن کاملMULTIPLICATION MODULES THAT ARE FINITELY GENERATED
Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module. An $R$-module $M$ is called a multiplication module if for every submodule $N$ of $M$ there exists an ideal $I$ of $R$ such that $N = IM$. It is shown that over a Noetherian domain $R$ with dim$(R)leq 1$, multiplication modules are precisely cyclic or isomorphic to an invertible ideal of $R$. Moreover, we give a charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arabian Journal of Mathematics
سال: 2022
ISSN: ['2193-5343', '2193-5351']
DOI: https://doi.org/10.1007/s40065-022-00388-8